Solving partial constraint satisfaction problems with tree decomposition
نویسندگان
چکیده
منابع مشابه
Solving partial constraint satisfaction problems with tree decomposition
In this paper, we describe a computational study to solve hard partial constraint satisfaction problems (PCSPs) to optimality. The PCSP is a general class of problems that contains a diversity of problems, such as generalized subgraph problems, MAX-SAT, Boolean quadratic programs, and assignment problems like coloring and frequency planning. We present a dynamic programming algorithm that solve...
متن کاملSolving Partial Constraint Satisfaction Problems using Local Search and Abstraction
Partial constraint satisfaction problems PCSPs were proposed by Freuder and Wallace to address some of the representational di culties with traditional constraint satisfaction techniques However the reasoning method of their proposal was limited to traditional backtracking based algorithms In this paper we extend the PCSP model by associating it with a local search algorithm which has found gre...
متن کاملPartial Domain Search Tree For Constraint-Satisfaction Problems
The traditional approach for solving Constraint satisfaction Problems (CSPs) is searching the Assignment Space in which each state represents an assignment to some variables. This paper suggests a new search space formalization for CSPs, the Partial Domain Search Tree (PDST). In each PDST node a unique subset of the original domain is considered, values are excluded from the domains in each nod...
متن کاملSolving Constraint Satisfaction Problems with DNA Computing
We demonstrate how to solve constraint satisfaction problems (CSPs) with DNA computing. Assuming that DNA operations can be faulty, we estimate error probability of our algorithm. We show that for any k-CSP, there is a polynomial-time DNA algorithm with bounded probability of error. Thus, k-CSPs belong to a DNA analogue of BPP.
متن کاملSolving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can be used to model combinatorial problems containing contingency or uncertainty. It allows for universally quantified variables that can model uncertain actions and events, such as the unknown weather for a future party, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2002
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.10046